Accumulate codes based on 1+D convolutional outer codes

From 1D Convolutional Codes to 2D Convolutional Codes of Rate 1/n

In this paper we introduce a new type of superregular matrices that give rise to novel constructions of two-dimensional (2D) convolutional codes with finite support. These codes are of rate 1/n and degree δ with n ≥ δ + 1 and achieve the maximum possible distance among all 2D convolutional codes with finite support with the same parameters.

Chapter 3 Coding Theorems for Convolutional Accumulate - m Codes

It is well-known that long random codes achieve reliable communication at noise levels up to the Shannon limit, but they provide no structure for efficient decoding. The introduction and analysis of Repeat Accumulate (RA) codes by Divsalar, Jin, and McEliece [10] shows that the concatenation of a repetition code and a rate-1 code, through a random interleaver, can also achieve reliable communic...

On Permutor Design for Woven Convolutional Codes with Outer Warp

A permutor design for woven convolutional encoders with outer warp is introduced. All warp permutors are considered jointly, and for the overall design an approach similar to that of higher order separations for serially concatenated convolutional codes is applied. We present a bound on the minimum distance of a code generated by a woven convolutional encoder with outer warp and designed row pe...

New convolutional codes from old convolutional codes

In this paper, starting with a family of convolutional codes, we construct a new convolutional code and we introduce also necessary and sufficient conditions in order that the new convolutional code is MDS.

On Woven Convolutional Codes